On Second-Order Monadic Monoidal and Groupoidal Quantifiers
نویسندگان
چکیده
We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a computational classification of the expressive power of these logics over strings with varying built-in predicates. In particular, we show that ATIME(n) can be logically characterized in terms of second-order monadic monoidal quantifiers.
منابع مشابه
On Second-Order Monadic Groupoidal Quantifiers
We study logics defined in terms of so-called second-order monadic groupoidal quantifiers. These are generalized quantifiers defined by groupoid word-problems or equivalently by context-free languages. We show that, over strings with built-in arithmetic, the extension of monadic second-order logic by all second-order monadic groupoidal quantifiers collapses to its fragment mon-QGrpFO. We also s...
متن کاملThe Descriptive Complexity Approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal quantifiers. Our work extends the elaborate theory relating monoidal quantifiers to NC and its subclasses. In the absence of the BIT predicate, we reso...
متن کاملThe hierarchy inside closed monadic Σ1 collapses on the infinite binary tree
Closed monadic Σ1, as proposed in [AFS98], is the existential monadic second order logic where alternation between existential second order quantifiers and first order quantifiers is allowed. Despite some effort very little is known about the expressive power of this logic on finite structures. We construct a tree automaton which exactly characterizes closed monadic Σ1 on the Rabin tree and giv...
متن کاملTowards Elimination of Second-Order Quantifiers in the Separated Fragment
It is a classical result that the monadic fragment of secondorder logic admits elimination of second-order quantifiers. Recently, the separated fragment (SF) of first-order logic has been introduced. SF generalizes the monadic first-order fragment without equality, while preserving decidability of the satisfiability problem. Therefore, it is a natural question to ask whether SF also admits elim...
متن کاملCharacterizing Definability of Second-Order Generalized Quantifiers
We study definability of second-order generalized quantifiers. We show that the question whether a second-order generalized quantifier Q1 is definable in terms of another quantifier Q2, the base logic being monadic second-order logic, reduces to the question if a quantifier Q1 is definable in FO(Q2, <,+,×) for certain first-order quantifiers Q1 and Q2. We use our characterization to show new de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logical Methods in Computer Science
دوره 6 شماره
صفحات -
تاریخ انتشار 2010